Linear Läuchli Semantics
نویسندگان
چکیده
We introduce a linear analogue of Lauchli's semantics for intuitionistic logic. In fact, our result is a strengthening of L auchli's work to the level of proofs, rather than provability. This is obtained by considering continuous actions of the additive group of integers on a category of topological vector spaces. The semantics, based on functorial polymorphism, consists of dinatural transformations which are equivariant with respect to all such actions. Such dinatural transformations are called uniform. To any sequent in Multiplicative Linear Logic (MLL), we associate a vector space of \diadditive" uniform transformations. We then show that this space is generated by denotations of cut-free proofs of the sequent in the theory MLL+MIX. Thus we obtain a full completeness theorem in the sense of Abramsky and Jagadeesan, although our result di ers from theirs in the use of dinatural transformations. As corollaries, we show that these dinatural transformations compose, and obtain a conservativity result: diadditive dinatural transformations which are uniform with respect to actions of the additive group of integers are also uniform with respect to the actions of arbitrary cocommutative Hopf algebras. Finally, we discuss several possible extensions of this work to noncommutative logic. It is well known that the intuitionistic version of L auchli's semantics is a special case of the theory of logical relations, due to Plotkin and Statman. Thus, our work can also be viewed as a rst step towards developing a theory of logical relations for linear logic and concurrency.
منابع مشابه
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels
We use formal semantic analysis based on new, model-theoretic constructions to generate intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning. Well-known modal semantic formalisms have been defined by Kripke and Beth, but these have no formal concepts corresponding to constructions, and shed little intuitive light on the meanings of form...
متن کاملVerifying Temporal Properties in Real Models
Based on pioneering work of Läuchli and Leonard in the 1960s, a novel and expressive formal language, Model Expressions, for describing the compositional construction of general linear temporal structures has recently been proposed. A sub-language, Real Model Expressions, is capable of specifying models over the real flow of time but its semantics are subtly different because of the specific pr...
متن کاملA categorical semantics for polarized MALL
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories C−/C+ of an ambient ∗-autonomous category C (with products). Similar structures were first introduced by ...
متن کاملLäuchli's Completeness Theorem from a Topos-Theoretic Perspective
We prove a variant of Läuchli’s completeness theorem for intuitionistic predicate calculus. The formulation of the result relies on the observation (due to Lawvere) that Läuchli’s theorem is related to the logic of the canonical indexing of the atomic topos of Z-sets. We show that the process that transforms Kripke-counter-models into Läuchli-counter-models is (essentially) the inverse image of...
متن کاملThe Halpern-läUchli Theorem at a Measurable cardinal
Several variants of the Halpern-Läuchli Theorem for trees of uncountable height are investigated. For κ weakly compact, we prove that the various statements are all equivalent, and hence, the strong tree version holds for one tree on any weakly compact cardinal. For any finite d ≥ 2, we prove the consistency of the Halpern-Läuchli Theorem on d many normal κ-trees at a measurable cardinal κ, giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 77 شماره
صفحات -
تاریخ انتشار 1996